Dynamic Load Balancing for Adaptive Mesh Refinement Applications: Improvements and Sensitivity Analysis
نویسندگان
چکیده
Adaptive Mesh Refinement (AMR) is a type of multiscale algorithm that dynamically achieves high resolution in localized regions of multidimensional numerical simulations. A dynamic load balancing(DLB) scheme for structured AMR applications was proposed in [19]. Unfortunately, the overhead introduced by this DLB scheme is significant. Further, a parameter called threshold is used in this scheme which determines whether a load balancing process should be invoked; its value directly influence the efficiency of the overall DLB scheme. In this paper, we first present two improvements on this DLB scheme to reduce its overhead. Then a detailed sensitivity analysis is provided to identify an optimal value for the parameter threshold. Experiments show that by interleaving grid splitting with direct grid movement and by employing nonblocking communication, the execution time can be improved by up to 32% and the overhead can be reduced as much as 18%; and setting threshold to be around 1:25 is optimal.
منابع مشابه
Dynamic Load Balancing for Parallel Finite Element Methods with Adaptive h-and p-Refinement
We describe a dynamic load-balancing strategy for parallel finite element methods with adaptive mesh (h-) and order (p-) refinement. The load-balancing algorithm is based on the tiling load-balancing system, where global balance is achieved by performing local balancing within overlapping neighborhoods of processors. Tiling is applied to each mesh level created by the adaptive h-refinement. Wei...
متن کاملMiniAMR - A miniapp for Adaptive Mesh Refinement
We present a new implementation of MiniAMR, a miniapp for adaptive mesh refinement (AMR) that mimics commonly found workloads and communication patterns in AMR applications. We obtain significant performance improvements by using new data structures and algorithms. One of our important areas of focus in this work is the use of low-overhead distributed load balancing schemes for octree partition...
متن کاملDynamic Load Partitioning Strategies for Managing Data of Space and Time Heterogeneity in Parallel SAMR Applications
This paper presents the design and experimental evaluation of two dynamic load partitioning and balancing strategies for parallel Structured Adaptive Mesh Refinement (SAMR) applications: the Level-based Partitioning Algorithm (LPA) and the Hierarchical Partitioning Algorithm (HPA). These techniques specifically address the computational and communication heterogeneity across refinement levels o...
متن کاملA Performance Characterization of Load Balancing Algorithms for Parallel SAMR Applications
We perform a comprehensive performance characterization of load balancing algorithms for parallel structured adaptive mesh refinement (SAMR) applications. Using SAMR, computational resources are dynamically concentrated to areas in need of a high accuracy. Because of the dynamic resource allocation, the workload must repeatedly be partitioned and distributed over the processors. For an efficien...
متن کاملA novel dynamic load balancing scheme for parallel systems
Adaptive mesh refinement (AMR) is a type of multiscale algorithm that achieves high resolution in localized regions of dynamic, multidimensional numerical simulations. One of the key issues related to AMR is dynamic load balancing (DLB), which allows large-scale adaptive applications to run efficiently on parallel systems. In this paper, we present an efficient DLB scheme for structured AMR (SA...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001